Large constant dimension codes and lexicodes
نویسندگان
چکیده
Constant dimension codes, with a prescribed minimum distance, have found recently an application in network coding. All the codewords in such a code are subspaces of Fq with a given dimension. A computer search for large constant dimension codes is usually inefficient since the search space domain is extremely large. Even so, we found that some constant dimension lexicodes are larger than other known codes. We show how to make the computer search more efficient. In this context we present a formula for the computation of the distance between two subspaces, not necessarily of the same dimension.
منابع مشابه
Lexicographic codes: Error-correcting codes from game theory
A~.~hslruct-Lexicographic codes, or lexicodes, are defined by various versions of the greedy algorithm. The theory of these codes is closely related to the theory of certain impartial games, which leads to a number of surprising properties. For example, lexicodes over an alphabet of size B = 2” are closed under addition;’ while if B = 22u the lexicodes are closed under multiplication by scalars...
متن کاملError-Correcting Codes Derived from Combinatorial Games
The losing positions of certain combinatorial games constitute linear error-detecting and -correcting codes. We show that a large class of games, which can be cast in the form of annihilation games, provides a potentially polynomial method for computing codes (anncodes). We also give a short proof of the basic properties of the previously known lexicodes, which were defined by means of an expon...
متن کاملIsotropic Constant Dimension Subspace Codes
In network code setting, a constant dimension code is a set of k-dimensional subspaces of F nq . If F_q n is a nondegenerated symlectic vector space with bilinear form f, an isotropic subspace U of F n q is a subspace that for all x, y ∈ U, f(x, y) = 0. We introduce isotropic subspace codes simply as a set of isotropic subspaces and show how the isotropic property use in decoding process, then...
متن کاملLexicodes over rings
In this paper, we consider the construction of linear lexicodes over finite chain rings by using a B-ordering over these rings and a selection criterion. As examples we give lexicodes over Z4 and F2 + uF2. It is shown that this construction produces many optimal codes over rings and also good binary codes. Some of these codes meet the Gilbert bound. We also obtain optimal self-dual codes, in pa...
متن کاملError Correcting Codes and Combinatorial Games
The \losing positions" of certain combinatorial games constitute linear error detecting and correcting codes. We show that annihilation games provide a potentially polynomial method for computing codes (anncodes). We also give a short proof of the basic properties of the previously known lexicodes, which are deened by means of an exponential algorithm, and are related to game theory. In the nal...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Adv. in Math. of Comm.
دوره 5 شماره
صفحات -
تاریخ انتشار 2011